Game Theory : Lecture 4
نویسنده
چکیده
منابع مشابه
5 . Applications to streaming
In this lecture, we will see applications of communication complexity to proving lower bounds for streaming algorithms. Towards the end of the lecture, we will introduce combinatorial auctions, and we will see applications of communication complexity to auctions in the next lecture. The references for this lecture include Lecture 7 of Troy Lee’s course on communication complexity [Lee10], Lectu...
متن کاملAlgorithms for Computing Solution Concepts in Game Theory
These are notes for the first five lectures of the course on Algorithmic Game Theory, given (starting November 2008) in the Weizmann Institute jointly by Uriel Feige, Robert Krauthgamer and Moni Naor. The lecture notes are not intended to provide a comprehensive view of solution concepts in game theory, but rather discuss some of the algorithmic aspects involved. Hence some of the definitions w...
متن کاملCS 364 A : Algorithmic Game Theory Lecture # 17 : No - Regret Dynamics ∗
This lecture continues to study the questions introduced last time. Do strategic players reach an equilibrium of a game? How quickly? By what learning processes? Positive results on these questions justify equilibrium analysis, including bounds on the price of anarchy. Last lecture focused on best-response dynamics. These dynamics are most relevant for potential games, which cover many but not ...
متن کاملNetwork Design and Game Theory Spring 2008 Lecture 4 Instructor : Mohammad
In this lecture we introduce the technique of probabilistic embedding of arbitrary graphs into trees and describe some of its applications. We give various definitions, theorems and present approximation algorithms making use of probabilistic embedding. The main benefit that we get out of embedding graphs into trees is that we can then solve the given graph problem on the corresponding tree, wh...
متن کاملCS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗
Today we continue our study of the limitations of learning dynamics and polynomial-time algorithms for converging to and computing equilibria. Recall that we have sweeping positive results for coarse correlated and correlated equilibria, which are tractable in arbitrary games. We have only partial positive results for pure Nash equilibria of routing and congestion games, and last lecture we dev...
متن کامل